Infinite Communication Complexity
نویسندگان
چکیده
Suppose that Alice and Bob are given each an infinite string, and they want to decide whether their two strings are in a given relation. How much communication do they need? How can communication be even defined and measured for infinite strings? In this article, we propose a formalism for a notion of infinite communication complexity, prove that it satisfies some natural properties and coincides, for relevant applications, with the classical notion of amortized communication complexity. Moreover, an application is given for tackling some conjecture about tilings and multidimensional sofic shifts.
منابع مشابه
Infinite separation of quantum information and communication
We prove an infinite separation between quantum information complexity and quantum communication complexity by considering the exclusion game, first introduced by Perry, Jain and Oppenheim [1], who showed that for appropriately chosen parameters of the game, the quantum information cost vanishes as the size of the problem n increases. We extend their result by showing that for those parameters,...
متن کاملGenerated topology on infinite sets by ultrafilters
Let $X$ be an infinite set, equipped with a topology $tau$. In this paper we studied the relationship between $tau$, and ultrafilters on $X$. We can discovered, among other thing, some relations of the Robinson's compactness theorem, continuity and the separation axioms. It is important also, aspects of communication between mathematical concepts.
متن کاملConnections, Communication and Collaboration in Healthcare’s Complex Adaptive Systems; Comment on “Using Complexity and Network Concepts to Inform Healthcare Knowledge Translation”
A more sophisticated understanding of the unpredictable, disorderly and unstable aspects of healthcare organisations is developing in the knowledge translation (KT) literature. In an article published in this journal, Kitson et al introduced a new model for KT in healthcare based on complexity theory. The Knowledge Translation Complexity Network Model (KTCNM) provides a fresh perspective by mak...
متن کاملCommunication Complexity of Cake Cutting
We study classic cake-cutting problems, but in discrete models rather than using infiniteprecision real values, specifically, focusing on their communication complexity. Using general discrete simulations of classical infinite-precision protocols (Robertson-Webb and movingknife), we roughly partition the various fair-allocation problems into 3 classes: “easy” (constant number of rounds of logar...
متن کاملCommunication Complexity and Regular Expression Size
We consider the problem of converting a deterministic finite automaton (DFA) into a short regular expression (RE). Examples given by Ehrenfeucht and Zeiger in the 1970s show that the required expression size in the worst case is 2Θ(n) for infinite languages, and for finite languages in nΩ(log log n) and nO(logn), if the alphabet size is allowed to grow with the number of states n of the given a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1501.05814 شماره
صفحات -
تاریخ انتشار 2015